Solving Ramified Optimal Transport Problem in the Bayesian Influence Diagram Framework
نویسندگان
چکیده
The goal of the ramified optimal transport is to find an optimal transport path between two given probability measures. One measure can be identified with a source while the other one with a target. The problem is well known to be NP–hard. We develop an algorithm for solving a ramified optimal transport problem within the framework of Bayesian networks. It is based on the decision strategy optimisation technique that utilises self–annealing ideas of Chen–style stochastic optimisation. Resulting transport paths are represented in the form of tree– shaped structures. The effectiveness of the algorithm has been tested on computer–generated examples.
منابع مشابه
Representing and Solving Asymmetric Bayesian Decision Problems
This paper deals with the representation and solution of asymmetric Bayesian decision problems. We present a formal framework, termed asymmetric influence diagrams, that is based on the influence diagram and al lows an efficient representation of asymmet ric decision problems. As opposed to exist ing frameworks, the asymmetric influence di agram primarily encodes asymmetry at the qualitativ...
متن کاملSolving Asymmetric Decision Problems with Influence Diagrams
While influence diagrams have many ad vantages as a representation framework for Bayesian decision problems, they have a se rious drawback in handling asymmetric de cision problems. To be represented in an influence diagram, an asymmetric decision problem must be symmetrized. A consid erable amount of unnecessary computation may be involved when a symmetrized influ ence diagram is evaluate...
متن کاملA New Stochastic Algorithm for Strategy Optimisation in Bayesian Influence Diagrams
The problem of solving general Bayesian influence diagrams is well known to be NP-complete, whence looking for efficient approximate stochastic techniques yielding suboptimal solutions in reasonable time is well justified. The purpose of this paper is to propose a new stochastic algorithm for strategy optimisation in Bayesian influence diagrams. The underlying idea is an extension of that prese...
متن کاملFlexible Policy Construction by Information Refinement
We report on work towards flexible algorithms for solving decision problems represented as influence diagrams. An algorithm is given to construct a tree structure for each decision node in an influence diagram. Each tree represents a decision function and is constructed incrementally. The improvements to the tree converge to the optimal decision function (neglecting computational costs) and the...
متن کاملMulti-currency Influence Diagrams
When using the influence diagrams framework for solving a decision problem with several different quantitative utilities, the traditional approach has been to convert the utilities into one common currency. This conversion is carried out using a tacit transformation, under the assumption that the converted problem is equivalent to the original one. In this paper we present an extension of the i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012